An Efficient Q -Algorithm for RFID Tag Anticollision

In large-scale Internet of Things (IoT) applications, tags are attached to items, and users use a radiofrequency identification (RFID) reader quickly identify obtain the corresponding item information. Since multiple share same channel communicate with reader, when they respond simultaneously, tag collision will occur, cannot successfully information from tag. To cope problem, ultrahigh frequency (UHF) RFID standard EPC G1 Gen2 specifies an anticollision protocol large number in efficient way. The Q -algorithm has attracted much more attention as efficiency C1 Gen2-based system can be significantly improved by only slight adjustment algorithm. this paper, we propose novel id="M3"> for identification, namely, HTEQ, which optimizes time utmost limit. Extensive simulations verify that our proposed HTEQ is exceptionally expeditious compared other algorithms, promises it competitive IoT environments.